Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
نویسندگان
چکیده
We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well.
منابع مشابه
Bisimulation equivalence and regularity for real-time one-counter automata
A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no ε-transitions. We study the computational complexity of the problems of equivalence and regularity (i.e. semantic finiteness) on real-time one-counter automata. The first main result shows PSPACE-completeness of bisimulation equivale...
متن کاملVisibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simu...
متن کاملComplexity of Topological Properties of Regular ω-Languages
We determine the complexity of topological properties (i.e., properties closed under the Wadge equivalence) of regular ω-languages by showing that they are typically NL-complete (PSPACEcomplete) for the deterministic Muller, Mostowski and Büchi automata (respectively, for the nondeterministic Rabin, Muller, Mostowski and Büchi automata). For the deterministic Rabin and Streett automata and for ...
متن کاملBeyond Language Equivalence on Visibly Pushdown Automata
We study (bi)simulation-like preorder/equivalence checking on visibly pushdown automata, visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulat...
متن کاملBüchi VASS recognise w-languages that are Sigma^1_1 - complete
This short note exhibits an example of a Σ1-complete language that can be recognised by a one blind counter Büchi automaton (or equivalently a Büchi VASS with only one place). In this work we study the topological complexity of ω-languages recognised by vector addition systems with states equipped with Büchi acceptance condition (Büchi VASS). This model corresponds, from the automata theoretic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011